Temporal Query Processing and Optimization in Multiprocessor Database Machines
نویسندگان
چکیده
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel processing strategies, which are based on partitioning of temporal relations on timestamp values, for multi-way joins (e.g., complex temporal pattern queries) and optimization alternatives. We analyze the proposed schemes quantitatively, and show their advantages in computing complex temporal joins.
منابع مشابه
Tradeoffs in Processing Complex Join Queries via Hashing Multiprocessor Database Machines
In this paper we examine the problem of processing multi-way join queries (on the order of 10 joins) through hash-based join methods in a shared-nothing database machine. We first discuss how the choice of a format for a complex query can significantly affect performance in a multiprocessor database machine. Several query processing algorithms are then proposed and experimental results obtained...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملHybrid-Range Partitioning Skate y: A New Deelustering Strategy for Multiprocessor 8 atabase Machines
In shared-nothing multiprocessor database machines, the relational operators that form a query are executed on the processors where the relations they reference are stored. In general, as the number of processors over which a relation is declustered is increased, the execution time for the query is decreased because more processors are used, each of which has to process fewer tuples. However, f...
متن کاملTradeoffs in Processing Multi-Way Join Queries via Hashing in Multiprocessor Database Machines
During the past five years the design, implementation, and evaluation of join algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, most of this work has addressed the problem of executing joins involving only two relations. In this paper we examine the problem of processing multi-way join queries through hash-based join methods in ...
متن کاملA Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has been done on temporal query processing and optimization. In this paper, we propose a uniform framework for processing temporal queries, which builds upon well-understood techniques for processing non-temporal queries. We ...
متن کامل